An Algebraic Preservation Theorem for א0-categorical Quantified Constraint Satisfaction
نویسندگان
چکیده
We prove an algebraic preservation theorem for positive Horn definability in א0-categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of a structure to be a homomorphism from the periodic power of the structure to the structure itself. Our preservation theorem states that, over an א0-categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. We give applications of this theorem, including a new proof of the known complexity classification of quantified constraint satisfaction on equality templates.
منابع مشابه
The Infinity Project
We prove a preservation theorem for positive Horn definability inא0-categorical structures.In particular, we define and study a construction which we call the periodic power of a structure, anddefine a periomorphism of a structure to be a homomorphism from the periodic power of the structureto the structure itself. Our preservation theorem states that, over anא0-categorical ...
متن کاملNon-dichotomies in Constraint Satisfaction Complexity
We show that every computational decision problem is polynomialtime equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ ) and CSP(Γ ) is in coNP (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates are of special interest, because the uni...
متن کاملSpecial groups whose isometry relation is a finite union of cosets
א0-stable א0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are א0stable, א0-categorical, satisfy AP (3) and have finite 2-symbol length. They are also related to special groups whose isometry relation is a finite union of cosets, which are then considered on their own, as well as their links with pseudofinite, profinite ...
متن کاملLooking Algebraically at Tractable Quantified Boolean Formulas
We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were ...
متن کاملDatalog and Constraint Satisfaction with Infinite Templates
On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite structures. This has applications for constraint satisfaction with infinite templates. If the template Γ is ω-categorical, we present various equivalent characterizations for whet...
متن کامل